Generalized Results on Monoids as Memory
نویسندگان
چکیده
منابع مشابه
Generalized Results on Monoids as Memory
We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we prove that the context-free language L1 ∗ = {ab : n ≥ 1}∗ can not be recognized by any rational monoid automaton over a finitely generated permutable monoid. We show that the class of la...
متن کاملOn Some Generalized Valuation Monoids
The valuation monoids and pseudo-valuation monoids have been established through valuation domains and pseudo-valuation domains respectively. In this study we continue these lines to describe the almost valuation monoids, almost pseudo-valuation monoids and pseudoalmost valuation monoids. Further we also characterized the newly described monoids as the spirit of valuation monoids pseudo-valuati...
متن کاملGeneralized affine transformation monoids on Galois rings
Let A be a ring with identity. The generalized affine transformation monoid Gaff(A) is defined as the set of all transformations on A of the form x → xu + a (for all x ∈ A), where u,a∈ A. We study the algebraic structure of the monoid Gaff(A) on a finite Galois ring A. The following results are obtained: an explicit description of Green’s relations on Gaff(A); and an explicit description of the...
متن کاملFurther Results on Monoids Acting on Trees
This paper further develops the theory of arbitrary semigroups acting on trees via elliptic mappings. A key tool is the Lyndon-Chiswell length function L for the semigroup S which allows one to construct a tree T and an action of S on T via elliptic maps. Improving on previous results, the length function of the action will also be L.
متن کاملOn the Elasticity of Generalized Arithmetical Congruence Monoids
An arithmetical congruence monoid (or ACM ) is a multiplicative monoid, which consists of an arithmetic sequence and the element 1. As they are traditionally defined, it is required that a ≤ b and a ≡ a (mod b) must hold to ensure closure. It is well known that unique factorization need not occur in ACMs. In this paper, we investigate factorization results when the requirement a ≤ b is dropped....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2017
ISSN: 2075-2180
DOI: 10.4204/eptcs.252.22